翻訳と辞書 Words near each other ・ Frequency domain sensor ・ Frequency drift ・ Frequency extender ・ Frequency following response ・ Frequency format hypothesis ・ Frequency frogging ・ Frequency grid ・ Frequency Level Expander ・ Frequency meter ・ Frequency mixer ・ Frequency modulation ・ Frequency modulation synthesis ・ Frequency multiplier ・ Frequency of optimum transmission ・ Frequency offset ・ Frequency partition of a graph ・ Frequency response ・ Frequency scaling ・ Frequency scanning interferometry ・ Frequency selective surface ・ Frequency separation ・ Frequency sharing ・ Frequency shift ・ Frequency specific microcurrent ・ Frequency standard ・ Frequency synthesizer ・ Frequency Unknown ・ Frequency-Agile Solar Radiotelescope ・ Frequency-change signaling ・ Frequency-dependent foraging by pollinators Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Frequency partition of a graph ： ウィキペディア英語版 Frequency partition of a graph In graph theory, a discipline within mathematics, the frequency partition of a graph (simple graph) is a partition of its vertices grouped by their degree. For example, the degree sequence of the left-hand graph below is (3, 3, 3, 2, 2, 1) and its frequency partition is 6 = 3 + 2 + 1. This indicates that it has 3 vertices with some degree, 2 vertices with some other degree, and 1 vertex with a third degree. The degree sequence of the bipartite graph in the middle below is (3, 2, 2, 2, 2, 2, 1, 1, 1) and its frequency partition is 9 = 5 + 3 + 1. The degree sequence of the right-hand graph below is (3, 3, 3, 3, 3, 3, 2) and its frequency partition is 7 = 6 + 1. Image:6n-graf.svg|A graph with frequency partition 6 = 3 + 2 + 1. Image:Simple-bipartite-graph.svg|A bipartite graph with frequency partition 9 = 5 + 3 + 1. Image:Nonplanar no subgraph K 3 3.svg|A graph with frequency partition 7 = 6 + 1. In general, there are many non-isomorphic graphs with a given frequency partition. A graph and its complement have the same frequency partition. For any partition ''p'' = ''f''1 + ''f''2 + ... + ''f''''k'' of an integer ''p'' > 1, other than ''p'' = 1 + 1 + 1 + ... + 1, there is at least one (connected) simple graph having this partition as its frequency partition. Frequency partitions of various graph families are completely identifieds; frequency partitions of many families of graphs are not identified. ==Frequency partitions of Eulerian graphs== For a frequency partition ''p'' = ''f''1 + ''f''2 + ... + ''f''''k'' of an integer ''p'' > 1, its graphic degree sequence is denoted as ((d1)f1,(d2)f2, (d3)f3, ..., (dk) fk) where degrees di's are different and ''f''i ≥ ''f''j for ''i'' < ''j''. Bhat-Nayak ''et al.'' (1979) showed that a partition of p with k parts, k ≤ integral part of $(p-1)/2$ is a frequency partition〔. Also in Lecture Notes in Mathematics, Combinatorics and Graph Theory, Springer-Verlag, New York, Vol. 885 (1980), p 500. 〕 of a Eulerian graph and conversely. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Frequency partition of a graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.